Optimal Information Dissemination in Star and Pancake Networks
نویسندگان
چکیده
This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide & conquer paradigm for weak order problems on very complex architectures as the Star graph or the Pancake. As applications, we introduce asymptotically optimal algorithms for Broadcasting, Gossiping, and Semigroup operations for such interconnection networks, improving the best known bounds for these problems.
منابع مشابه
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
Among Cayley graphs on the symmetric group, some that have noticeably low diameter relative to the number of generators involved are the pancake network, burnt pancake network, and cycle prefix network [1,6,7,8]. Another such Cayley graph is the star network, and constructions have been given for one-to-one and one-tomany low dilation embeddings of hypercubes into star networks [11,12,15]. For ...
متن کاملBroadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs th...
متن کاملComparative Analysis of Information Dissemination Capabilities of Media and Social Networks
Background and Aim: Human Knowledge depends on data and information that is emerged and transffered from different channels. The dessimination process is different from type, form of transfer, and distribution based on information or awareness. This survey compares the librarians and information scienctist’s information transferring capabilities in mass media and social networks. Methods: This ...
متن کاملComparing Star and Pancake Networks
Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge betw...
متن کاملFundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 7 شماره
صفحات -
تاریخ انتشار 1993